Planar Topological Routing - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
نویسندگان
چکیده
We develop a simple linear time algorithm to determine if a collection of two-pin nets can be routed, topologically, in a plane (i.e., single layer). Experiments indicate that this algorithm is faster than the linear time algorithm of Marek-Sadowska and Tarng. Topological routability testing of a collection of multipin nets is shown to be equivalent to planarity testing, and a simple linear time algorithm is developed for the case when the collection of modules remains connected following the deletion of all nets with more than two pins.
منابع مشابه
On the k-layer planar subset and topological via minimization problems
An important problem in performance-driven routing is the k -layer planar subset problem which is to choose a maximum (weighted) subset of nets such that each net in the subset can be routed in one of k ‘‘preferred’’ layers. Related to the k -layer planar subset problem is the k -layer topological via-minimization problem which is to determine the topology of each net using k routing layers suc...
متن کاملEfficient implementation of a planar clock routing with thetreatment of obstacles
In this paper, we present an automatic clock tree design (ACTD) system for high speed VLSI designs. The ACTD is designed to extend the capabilities of the existing computer aided design tools and provides a convenient environment to CAD users. We have developed new theoretical analyses and heuristics. Specifically, the following issues are considered: (i) a planar clock routing, (ii) a solution...
متن کاملPlanar-DME: A Single-Layer Zero-Skew Clock Tree Router - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
This paper presents new single-layer, i.e., planarembeddable, clock tree constructions with exact zero skew under either the linear or the Elmore delay model. Our method, called Planar-DME, consists of two parts. The first algorithm, called Linear-Planar-DME, guarantees an optimal planar zero-skew clock tree (ZST) under the linear delay model. The second algorithm, called Elmore-Planar-DME, use...
متن کاملNew Performance-Driven FPGA Routing Algorithms - Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions significantly outperform the best known ones and have provably good performance bounds. Our arborescence heuristics produce routing solutions with optimal source–sink pathlengths, and with wirelength on par with the best exist...
متن کاملSPAR: a schematic place and route system
This paper presents an approach to the automatic generation of schematic diagrams from circuit descriptions. The heuristics which make up the system are based on two principles of schematics readability: Functional Identi cation and Traceability. SPAR's generation process is broken into ve distinct phases: partitioning the netlist, placement of components on the page, global routing, local rout...
متن کامل